Cross Ratio Graphs
نویسندگان
چکیده
A family of arc-transitive graphs is studied. The vertices of these graphs are ordered pairs of distinct points from a finite projective line, and adjacency is defined in terms of the cross ratio. A uniform description of the graphs is given, their automorphism groups are determined, the problem of isomorphism between graphs in the family is solved, some combinatorial properties are explored, and the graphs are characterised as a certain class of arc-transitive graphs. Some of these graphs have arisen as examples in studies of arc-transitive graphs with complete quotients and arc-transitive graphs which ‘almost cover ’ a 2-arc transitive graph.
منابع مشابه
Classification of a family of symmetric graphs with complete 2-arc-transitive quotients
In this paper we give a classification of a family of symmetric graphs with complete 2-arc transitive quotients. Of particular interest are two subfamilies of graphs which admit an arc-transitive action of a projective linear group. The graphs in these subfamilies can be defined in terms of the cross ratio of certain 4-tuples of elements of a finite projective line, and thus may be called the s...
متن کاملComparison of Lift and Drag Forces for Some Conical Bodies in Supersonic Flow Using Perturbation Techniques
Numerical methods are not always convergent especially in higher velocities when shock waves are involved. A comparison analysis is performed to study the supersonic flow over conical bodies of three different cross sections circular, elliptic and squircle (square with rounded corners) shaped using Perturbation techniques to find flow variables analytically. In order to find lift and drag forc...
متن کاملSecret Sharing Based On Cartesian product Of Graphs
The purpose of this paper is to study the information ratio of perfect secret sharing of product of some special families of graphs. We seek to prove that the information ratio of prism graphs $Y_{n}$ are equal to $frac{7}{4}$ for any $ngeq 5$, and we will gave a partial answer to a question of Csirmaz cite{CL}. We will also study the information ratio of two other families $C_{m}times C_{n}$ a...
متن کاملComplexity and approximation ratio of semitotal domination in graphs
A set $S subseteq V(G)$ is a semitotal dominating set of a graph $G$ if it is a dominating set of $G$ andevery vertex in $S$ is within distance 2 of another vertex of $S$. Thesemitotal domination number $gamma_{t2}(G)$ is the minimumcardinality of a semitotal dominating set of $G$.We show that the semitotal domination problem isAPX-complete for bounded-degree graphs, and the semitotal dominatio...
متن کاملSome properties of higher order delaunay and gabriel graphs
We consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the following combinatorial and geometric properties of these graphs: spanning ratio, diameter, chromatic number, and minimum number of layers necessary to partition the edges of the graphs so that no two edges of the same laye...
متن کامل